Chen and Chvátal’s conjecture in tournaments
نویسندگان
چکیده
In a directed graph D, given two distinct vertices u and v, the line defined by ordered pair (u,v) is set of all w such that u,v belong to shortest path in containing from v. this work we study following conjecture: number lines any strongly connected at least its vertices, unless there vertices. Our main result tournament satisfies conjecture; also prove for bipartite tournaments diameter most three.
منابع مشابه
A conjecture on cycle-pancyclism in tournaments
Let T be a hamiltonian tournament with n vertices and γ a hamiltonian cycle of T . In previous works we introduced and studied the concept of cycle-pancyclism to capture the following question: What is the maximum intersection with γ of a cycle of length k? More precisely, for a cycle Ck of length k in T we denote Iγ(Ck) = |A(γ) ∩ A(Ck)|, the number of arcs that γ and Ck have in common. Let f(k...
متن کاملHoàng-Reed conjecture holds for tournaments
Hoàng-Reed conjecture asserts that every digraphD has a collection C of circuits C1, . . . , Cδ+ , where δ is the minimum outdegree of D, such that the circuits of C have a forest-like structure. Formally, |V (Ci) ∩ (V (C1) ∪ . . . ∪ V (Ci−1))| ≤ 1, for all i = 2, . . . , δ. We verify this conjecture for the class of tournaments. Key-words: tournament, forest-like structure, circuit ∗ Departmen...
متن کاملThe Hoàng-Reed Conjecture holds for tournaments
Hoàng-Reed conjecture asserts that every digraph D has a collection C of circuits C1, . . . , Cδ+ , where δ is the minimum outdegree of D, such that the circuits of C have a forest-like structure. Formally, |V (Ci) ∩ (V (C1) ∪ . . . ∪ V (Ci−1))| ≤ 1, for all i = 2, . . . , δ. We verify this conjecture for the class of tournaments.
متن کاملDisjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments
We prove that every tournament with minimum out-degree at least 2k− 1 contains k disjoint 3-cycles. This provides additional support for the conjecture by Bermond and Thomassen that every digraph D of minimum out-degree 2k − 1 contains k vertex disjoint cycles. We also prove that for every > 0, when k is large enough, every tournament with minimum out-degree at least (1.5+ )k contains k disjoin...
متن کاملThe Chen-Rubin conjecture in a continuous setting
We study the median m(x) in the gamma distribution with parameter x and show that 0 < m(x) < 1 for all x > 0. This proves a generalization of a conjecture of Chen and Rubin from 1986: The sequence m(n) − n decreases for n ≥ 1. We also describe the asymptotic behaviour of m and m at zero and at infinity. 2000 Mathematics Subject Classification: primary 60E05; secondary 41A60, 33B15.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2021
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2021.103374